Zero Capacity Region of Multidimensional Run Length Constraints
نویسندگان
چکیده
منابع مشابه
Zero Capacity Region of Multidimensional Run Length Constraints
For integers d and k satisfying 0 d k, a binary sequence is said to satisfy a one-dimensional (d; k) run length constraint if there are never more than k zeros in a row, and if between any two ones there are at least d zeros. For n 1, the n-dimensional (d; k)-constrained capacity is defined as C(n) d;k = lim m1;m2;:::;mn!1 log2N (n;d;k) m1;m2;:::;mn m1m2 mn where N (n;d;k) m1;m2;:::;mn denotes ...
متن کاملPartial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels
A binary sequence satisfies a one-dimensional (d; k) run length constraint if every run of zeros has length at least d and at most k. A two-dimensional binary pattern is (d1; k1; d2; k2)-constrained if it satisfies the one-dimensional (d1; k1) run length constraint horizontally and the one-dimensional (d2; k2) run length constraint vertically. For given d1; k1; d2, and k2, the asymmetric two-di...
متن کاملOn the capacity of two-dimensional run-length constrained channels
Two-dimensional binary patterns that satisfy onedimensional (d; k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity Cd; k is defined as Cd; k = limm;n!1 log2N (d; k) m;n =mn, where N (d; k) m;n denotes the number of m n rectangular patterns that satisfy the two-dimensional (d; k) run-length constraint. Bounds on Cd; k are given and it is ...
متن کاملNew Capacity-Approaching Codes for Run-Length-Limited Channels
To my parents ACKNOWLEDGEMENTS I have cherished the opportunity to work with Dr. Steven W. McLaughlin. His constant encouragement and enthusiasm have made us all feel comfortable. I am very grateful for his guidance, and wish him and his family the very best in coming years. V. Kuznetsov for several helpful discussions and insights. Other not-so-insightful, but nevertheless entertaining discuss...
متن کاملRun-Length FM-index
The FM-index is a succinct text index needing only O(Hkn) bits of space, where n is the text size and Hk is the kth order entropy of the text. FM-index assumes constant alphabet; it uses exponential space in the alphabet size, σ. In this paper we show how the same ideas can be used to obtain an index needing O(Hkn) bits of space, with the constant factor depending only logarithmically on σ. Our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1999
ISSN: 1077-8926
DOI: 10.37236/1465